Epidemic spreading driven by biased random walks
نویسندگان
چکیده
Random walk is one of the basic mechanisms found in many network applications. We study the epidemic spreading dynamics driven by biased random walks on complex networks. In our epidemic model, each time infected nodes constantly spread some infected packets by biased random walks to their neighbor nodes causing the infection of the susceptible nodes that receive the packets. An infected node get recovered from infection with a fixed probability. Simulation and analytical results on model and real-world networks show that the epidemic spreading becomes intense and wide with the increase of delivery capacity of infected nodes, average node degree, homogeneity of node degree distribution. Furthermore, there are corresponding optimal parameters such that the infected nodes have instantaneously the largest population, and the epidemic spreading process covers the largest part of a network.
منابع مشابه
Traffic Driven Epidemic Spreading in Weighted Homogeneous Networks
To investigate the impact of weights on the traffic driven epidemic spreading in weighted homogeneous networks, an epidemic model in pseudo-random network with adjustable weights is presented. In the scenario that epidemic pathway is defined and driven by traffic flows, the epidemic spreading velocity of SI model in weighted homogeneous networks is obviously accelerated when the edge weight is ...
متن کاملAperiodic quantum random walks.
We generalize the quantum random walk protocol for a particle in a one-dimensional chain, by using several types of biased quantum coins, arranged in aperiodic sequences, in a manner that leads to a rich variety of possible wave-function evolutions. Quasiperiodic sequences, following the Fibonacci prescription, are of particular interest, leading to a sub-ballistic wave-function spreading. In c...
متن کاملTraffic Driven Epidemic Spreading in Homogeneous Networks with Community Structure
To understand the effect of the community structure on the epidemic propagation in homogeneous networks, a model of pseudo-random network is presented with adjustable community structure and constant average degree. In the scenario that the propagation is driven by reaction processes from nodes to all neighbors, pronounced community structure can reduce the epidemic propagation velocity. While ...
متن کاملEffective distances for epidemics spreading on complex networks.
We show that the recently introduced logarithmic metrics used to predict disease arrival times on complex networks are approximations of more general network-based measures derived from random walks theory. Using the daily air-traffic transportation data we perform numerical experiments to compare the infection arrival time with this alternative metric that is obtained by accounting for multipl...
متن کاملar X iv : q ua nt - p h / 04 06 07 1 v 1 1 1 Ju n 20 04 Aperiodic Quantum Random Walks
We generalize the quantum random walk (QRW) protocol for a particle in a one-dimensional chain, by using several types of biased quantum coins, arranged in aperiodic sequences, in a manner that leads to a rich variety of possible wave function evolutions. Quasiperiodic sequences, following the Fibonacci prescription, are of particular interest, leading to a sub-ballistic wavefunction spreading....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1408.0063 شماره
صفحات -
تاریخ انتشار 2014